1446. Consecutive Characters

1. Question

The power of the string is the maximum length of a non-empty substring that contains only one unique character.

Given a string s, return the power of s.

2. Examples

Example 1:

Input: s = "leetcode"
Output: 2
Explanation: The substring "ee" is of length 2 with the character 'e' only.

Example 2:

Input: s = "abbcccddddeeeeedcba"
Output: 5
Explanation: The substring "eeeee" is of length 5 with the character 'e' only.

Example 3:

Input: s = "triplepillooooow"
Output: 5

Example 4:

Input: s = "hooraaaaaaaaaaay"
Output: 11

Example 5:

Input: s = "tourist"
Output: 1

3. Constraints

• 1 <= s.length <= 500
• s consists of only lowercase English letters.

4. References

来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/consecutive-characters 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

5. Solutions

class Solution {
    public int maxPower(String s) {
        if (s.length() <= 1) {
            return s.length();
        }

        int max = 0;
        int left = 0;
        int right = 1;

        while (left < s.length() - 1) {
            if (s.charAt(left) != s.charAt(right)) {
                left = right;
            }
            while (right < s.length() &&s.charAt(right) == s.charAt(left)) {
                right++;
            }
            max = Math.max(max, right - left);
            left = right;
        }
        return max;
    }
}